Recoverable Robust Timetable Information
نویسندگان
چکیده
Timetable information is the process of determining a suitable travel route for a passenger. Due to delays in the original timetable, in practice it often happens that the travel route cannot be used as originally planned. For a passenger being already en route, it would hence be useful to know about alternatives that ensure that his/her destination can be reached. In this work we propose a recoverable robust approach to timetable information; i.e., we aim at finding travel routes that can easily be updated when delays occur during the journey. We present polynomial-time algorithms for this problem and evaluate the performance of the routes obtained this way on schedule data of the German train network of 2013 and simulated delay scenarios. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems, G.2.2 Graph Theory (Graph algorithms, Network problems)
منابع مشابه
Demand-oriented timetable design for urban rail transit under stochastic demand
In the context of public transportation system, improving the service quality and robustness through minimizing the average passengers waiting time is a real challenge. This study provides robust stochastic programming models for train timetabling problem in urban rail transit systems. The objective is minimization of the weighted summation of the expected cost of passenger waiting time, its va...
متن کاملEngineering Time-Expanded Graphs for Faster Timetable Information
We present an extension of the well-known time-expanded approach for timetable information. By remodeling unimportant stations, we are able to obtain faster query times with less space consumption than the original model. Moreover, we show that our extensions harmonize well with speed-up techniques whose adaption to timetable networks is more challenging than one might expect.
متن کاملThe Price of Robustness in Timetable Information
In timetable information in public transport the goal is to search for a good passenger’s path between an origin and a destination. Usually, the travel time and the number of transfers shall be minimized. In this paper, we consider robust timetable information, i.e. we want to identify a path which will bring the passenger to the planned destination even in the case of delays. The classic notio...
متن کاملCo3O4 nanoparticles as a robust and recoverable catalyst for one-pot synthesis of polyhydroquinolines and tetrahydrobenzopyrans
This study introduces a green and efficient method for preparation of biologically-active substituted 4H-pyrans using the one-pot three-component reaction of aromatic aldehydes, dimedone and malononitrile in the presence of cobalt oxide nanoparticles. Co3O4 nanoparticles were used as an efficient catalyst for the synthesis of polyhydroquinoline derivatives by the reaction ...
متن کاملThe robust recoverable spanning tree problem with interval costs is polynomially solvable
In this paper the robust recoverable spanning tree problem with interval edge costs is considered. The complexity of this problem has remained open to date. It is shown that the problem is polynomially solvable, by using an iterative relaxation method. A generalization of this idea to the robust recoverable matroid basis problem is also presented. Polynomial algorithms for both robust recoverab...
متن کامل